The Mathematical Foundations of Bond Graphs-I. Algebraic Theory
نویسنده
چکیده
Elementary mathematical concepts from linear algebra are used to develop an independent theory for non-directed bond graphs. The dejinition of a bond graph is given and its structure as a combinatorial object is studied. This is accomplished by constructing a vector space, called the bond space of the bond graph. Topological information is encoded in the bond graph by dejining a subspace of the bond space, the s-space. The internal bond information is eliminated by studying subspaces of the s-space, the cycle and internal space. A precise meaning is given to the association between bond graphs and linear graphs by comparing their respective cycle spaces. A technique, called the cut and paste method, is described which produces a bond graph associated with a given graph via its planar representation. Several problems associated with the inverse procedure are discussed.
منابع مشابه
The Mathematical Foundations of Bond Graphs-II. Duality
A discussion of duality continues the development of a mathematical theory for bond graphs as combinatorial structures. The dual of a bondgraph is de$ned and its associated vector spaces are the co-spaces of the original bond graph. The relationship between the algebraic structures and their duals is explored. The theory is used to justfy the construction of a simplified bond graph, the proper ...
متن کاملThe Mathematical Foundations of Bond Graphs-III. Matroid Theory
The cycle and co-cycle matroids of a bond graph are defined using chain group matroids derived,from the cycle and co-cycle vector spaces qf a bond graph. The relationship between these structures is investigated and various results are proved. A precise equivalence is dejined for bond graphs. Duality theory is seen to be very clear in the context of bond graph matroids.
متن کاملThree Études in QFT
We review QFT from the algebraic structure of its perturbative expansion and point out three new results. Acknowledgments It is a pleasure to thank Spencer Bloch for questions which ultimately led to Theorem 3 below. The following is a write-up of an invited contribution to the International Congress for Mathematical Physics (Prague, 2009). Thanks are due to Pavel Exner and the other organizers...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کامل